Backward Error Analysis of Cyclic Reduction for the Solution of Tridiagonal Systems
نویسنده
چکیده
Tridiagonal systems play a fundamental role in matrix computation. In particular, in recent years parallel algorithms for the solution of tridiagonal systems have been developed. Among these, the cyclic reduction algorithm is particularly interesting. Here the stability of the cyclic reduction method is studied under the assumption of diagonal dominance. A backward error analysis is made, yielding a representation of the error matrix for the factorization and for the solution of the linear system. The results are compared with those for LU factorization.
منابع مشابه
Bounding the error in Gaussian elimination for tridiagonal systems
If is the computed solution to a tridiagonal system Ax b obtained by Gaussian elimination, what is the "best" bound available for the error x and how can it be computed efficiently? This question is answered using backward error analysis, perturbation theory, and properties of the LU factorization of A. For three practically important classes of tridiagonal matrix, those that are symmetric posi...
متن کاملParallel Numerical Algorithms for Symmetric Positive Definite Linear Systems
We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...
متن کاملSome aspects of the cyclic reduction algorithm for block tridiagonal linear systems
The solution of a general block tridiagonal linear system by a cyclic odd-even reduction algorithm is considered. Under conditions of diagonal dominance, norms describing the off-diagonal blocks relative to the diagonal blocks decrease quadratically with each reduction. This allows early termination of the reduction when an approximate solution is desired. The algorithm is well-suited for paral...
متن کاملDivide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...
متن کاملA VLSI Fast Solver for Tridiagonal Linear Systems
In this paper, the area-time complexity of a VLSI solver for tridiagonal linear systems is studied. Both a lower and an upper bound are derived which meet to within the exponent of the logarithmic factor. The proposed VLSI design derives from the parallel version of the well-known odd-even reduction algorithm [7] for tridiagonal linear systems, which requires O(log n) parallel steps. Then, the ...
متن کامل